An Improved Refinement and Decimation Method for Adaptive Terrain Surface Approximation

نویسنده

  • Hélio Pedrini
چکیده

An improved method for adaptively constructing a terrain surface representation from a set of data points is presented. Refinement and decimation steps are repeatedly applied to triangular meshes, incrementally determining a better distribution of the data points, while a specified error tolerance is preserved. Even though not asymptotically optimal or monotonically convergent, it produces approximations that are, experimentally, significantly better than those generated by straightforward greedy insertion algorithms. A new local error metric is used to select points to be inserted into the triangulation, based on the maximum vertical error weighted by the standard deviation calculated in a neighborhood of the candidate point. Conversely, a measure of angle between surface normals is used to determine whether a vertex should be removed from the triangulation. The method has been implemented and tested on both synthetic test cases and real terrain data sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Refinement and Hierarchical Coarsening Schemes for Triangulated Surfaces

We present a refinement and a coarsening (also simplification or decimation) algorithm for the adaptive representation of bivariate functions. The algorithms have proved to be efficient tools in numerical methods such as finite element method or image processing, [Pla00, Sua01b]. In this paper we particularize the algorithms and apply to the generation of levels of detail of terrain models. The...

متن کامل

Computational analysis of 4-8 meshes with application to surface simplification using global error

We present computational results when computing approximations of a class of meshes with subdivision connectivity, known as 4-8 meshes. We consider algorithms using vertex decimation or vertex insertion. We explain that a full decomposition of a 4-8 mesh using global error can be obtained with an (n logn) decimation algorithm. Our algorithm produces progressive and adaptive representations of t...

متن کامل

Terrain Decimation through Quadtree Morphing

We present a new terrain decimation technique called a Quadtree Morph, or Q-morph. The new approach eliminates the usual popping artifacts associated with polygon reduction, replacing them with less objectionable smooth morphing. We show that Q-morphing is fast enough to create a view-dependent terrain model for each frame in an interactive environment. In contrast to most Geomorph algorithms, ...

متن کامل

Comparison of different numerical methods for calculating stress intensity factors in analysis of fractured structures

In this research, an efficient Galerkin Finite Volume Method (GFVM) along with the h–refinement adaptive process and post–processing error estimation analysis is presented for fracture analysis. The adaptive strategy is used to produce more accurate solution with the least computational cost. To investigate the accuracy and efficiency of the developed model, the GFVM is compared with two versio...

متن کامل

Adaptive Refinement and Decimation under Free-Form Deformation

The Free-Form Deformation (FFD) methods are a family of intuitive, efficient and versatile free-form modelling techniques, which rely on an ambient warp of the space cocooning an embedded object. However, the distortion caused by FFD significantly degrades the approximation quality of polygon-mesh objects. We present a curvature-based adaptive refinement and decimation algorithm which solves th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001